Subgraph Isomorphism Based Intrinsic Function Reduction in Decompilation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subgraph Isomorphism Based Intrinsic Function Reduction in Decompilation

Program comprehension is one of the most important applications in decompilation. The more abstract the decompilation result the better it is understood. Intrinsic function is introduced by a compiler to reduce the overhead of a function call and is inlined in the code where it is called. When analyzing the decompiled code with lots of inlined intrinsic functions, reverse engineers may be confu...

متن کامل

AllDifferent-based filtering for subgraph isomorphism

The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with filtering techniques that aim at pruning branches that do not contain solutions. We introduce a new filtering algorithm based on local all different constraints. We show that this filtering is stronger than other exist...

متن کامل

Between Subgraph Isomorphism and Maximum Common Subgraph

When a small pattern graph does not occur inside a larger target graph, we can ask how to find “as much of the pattern as possible” inside the target graph. In general, this is known as the maximum common subgraph problem, which is much more computationally challenging in practice than subgraph isomorphism. We introduce a restricted alternative, where we ask if all but k vertices from the patte...

متن کامل

On Subgraph Isomorphism

Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.

متن کامل

Subgraph Isomorphism in Polynomial Time

In this paper, we propose a new approach to the problem of subgraph isomorphism detection. The new method is designed for systems which di erentiate between graphs that are a priori known, so-called model graphs, and unknown graphs, so-called input graphs. The problem to be solved is to nd a subgraph isomorphism from an input graph, which is given on-line, to any of the model graphs. The new me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Software Engineering and Applications

سال: 2016

ISSN: 1945-3116,1945-3124

DOI: 10.4236/jsea.2016.93007